Improved K-mean clustering with Mobile Agent

نویسندگان

  • Monali Patil
  • Vidya Chitre
  • Dipti Patil
چکیده

The data stream model has recently attracted attention for its applicability to numerous types of data, including telephone records, Web documents, and click streams. For analysis of such data, the ability to process the data in a single pass, or a small number of passes, while using little memory, is crucial. D-Stream algorithm is an extended grid-based clustering algorithm for different dimensional data streams. One of the disadvantages of D-Stream algorithm is the large number of grids, especially for high-dimensional data. So we use the mobile agent to deal with the different dimensional data. This method can reduce the number of the grids and the number of the update times. So using mobile agent technique with data stream algorithm we make the data stream clustering more simplified and

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved K-Means with Artificial Bee Colony Algorithm for Clustering Crimes

Crime detection is one of the major issues in the field of criminology. In fact, criminology includes knowing the details of a crime and its intangible relations with the offender. In spite of the enormous amount of data on offenses and offenders, and the complex and intangible semantic relationships between this information, criminology has become one of the most important areas in the field o...

متن کامل

Research on a Multi Node Cooperate Image Compression Algorithm for Wireless Network Based on LBT Model

In this paper, we proposed a new multi node cooperate image compression algorithm for wireless network based on LBT model. Firstly, the visual words of query image are built by using the K-means clustering method after the color features and SIFT features of query image are extracted. Then, the visual-words histogram of the query image is carried out by the mobile agent. The image similarity in...

متن کامل

Decentralized K-means clustering with MANET swarms

Swarm intelligent systems are efficient, decentralized multiagent problem-solving systems that offer several advantages over centrally controlled systems. A swarm intelligent system self-organizes into a structure that is robust, scalable, adaptable, and computationally efficient. Swarm intelligent systems, or swarms, utilize emergence, where simple local behaviors distributed across many agent...

متن کامل

Clustering Approach in Route Selection Using Mobile Agent in Mobile Ad-Hoc Network

Cluster-based mechanisms in ad hoc networks not only make a large network appear smaller, but more importantly. In our scheme, each MN is disseminated to predict its own mobility pattern, and this information is disseminated to its neighbors using a scalable clustering algorithm. The work proposes a prediction based Clustering Approach for Route Discovery Protocol (CARDP)using Mobile Agent in M...

متن کامل

Use of the Improved Frog-Leaping Algorithm in Data Clustering

Clustering is one of the known techniques in the field of data mining where data with similar properties is within the set of categories. K-means algorithm is one the simplest clustering algorithms which have disadvantages sensitive to initial values of the clusters and converging to the local optimum. In recent years, several algorithms are provided based on evolutionary algorithms for cluster...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012